Consensus algorithm for distributed ledger technology

ABSTRACT

A processor may receive, from two or more nodes in the blockchain, respective consideration from each of the two or more nodes at a first time. The processor may receive respective updates from each of the two or more nodes at a second time. The processor may determine whether a single node of the two or more nodes is available after the respective updates. The processor may designate the single node as the block generator node.

BACKGROUND

The present disclosure relates generally to the field of distributed ledger technology, and more specifically to providing a novel consensus algorithm for new block generation.

Currently, distributed ledger technology uses generic consensus algorithms, such as proof-of-work, proof-of-capacity, proof-of-stake, etc. While each algorithm provides a means for determining which node will generate a next block in a blockchain network, the algorithms unnecessarily waste energy due to the mining of the nodes and/or the algorithms limit which nodes can host a new block due to hardware limitations (e.g., storage space, CPU, etc.).

SUMMARY

Embodiments of the present disclosure include a method, system, and computer program for designating a block generator node within a blockchain. A processor may receive, from two or more nodes in the blockchain, respective consideration from each of the two or more nodes at a first time. The processor may receive respective updates from each of the two or more nodes at a second time. The processor may determine whether a single node of the two or more nodes is available after the respective updates. The processor may designate the single node as the block generator node.

The above summary is not intended to describe each illustrated embodiment or every implementation of the present disclosure.

BRIEF DESCRIPTION OF THE DRAWINGS

The drawings included in the present disclosure are incorporated into, and form part of, the specification. They illustrate embodiments of the present disclosure and, along with the description, serve to explain the principles of the disclosure. The drawings are only illustrative of certain embodiments and do not limit the disclosure.

FIG. 1A illustrates an example blockchain architecture, in accordance with embodiments of the present disclosure.

FIG. 1B illustrates a blockchain transactional flow, in accordance with embodiments of the present disclosure.

FIG. 2A illustrates an example system at the beginning of a block generator node auction, in accordance with embodiments of the present disclosure.

FIG. 2B illustrates the example system at a first time, in accordance with embodiments of the present disclosure.

FIG. 2C illustrates the example system at a second time, in accordance with embodiments of the present disclosure.

FIG. 2D illustrates the example system at a third time, in accordance with embodiments of the present disclosure.

FIG. 2E illustrates the example system at the end of the block generator node auction, in accordance with embodiments of the present disclosure.

FIG. 3 illustrates a flowchart of an example method for designating a block generator node within a blockchain, in accordance with embodiments of the present disclosure.

FIG. 4A illustrates a cloud computing environment, in accordance with embodiments of the present disclosure.

FIG. 4B illustrates abstraction model layers, in accordance with embodiments of the present disclosure.

FIG. 5 illustrates a high-level block diagram of an example computer system that may be used in implementing one or more of the methods, tools, and modules, and any related functions, described herein, in accordance with embodiments of the present disclosure.

While the embodiments described herein are amenable to various modifications and alternative forms, specifics thereof have been shown by way of example in the drawings and will be described in detail. It should be understood, however, that the particular embodiments described are not to be taken in a limiting sense. On the contrary, the intention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the disclosure.

DETAILED DESCRIPTION

Aspects of the present disclosure relate generally to the field of distributed ledger technology, and more specifically to providing a novel consensus algorithm for new block generation. Currently, with most consensus algorithms, the probability of being picked as a node to generate/host the next block in the blockchain is predetermined by algorithm assumptions. For instance, the probability in a proof-of-work consensus algorithm is dependent on computing power of participating nodes and the probability in a proof-of-stake consensus algorithm increases with the number of coins possessed by the participating nodes. Presented in this disclosure is a consensus algorithm where the node owner has an impact on their probability of generating the next block in the blockchain by choosing the providing consideration to increase the probability and/or withdrawing from the consensus algorithm.

Before turning to the FIGS., it will be readily understood that the instant components, as generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Accordingly, the following detailed description of the embodiments of at least one of a method, apparatus, non-transitory computer readable medium and system, as represented in the attached figures, is not intended to limit the scope of the application as claimed but is merely representative of selected embodiments.

The instant features, structures, or characteristics as described throughout this specification may be combined or removed in any suitable manner in one or more embodiments. For example, the usage of the phrases “example embodiments,” “some embodiments,” or other similar language, throughout this specification refers to the fact that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least one embodiment. Accordingly, appearances of the phrases “example embodiments,” “in some embodiments,” “in other embodiments,” or other similar language, throughout this specification do not necessarily all refer to the same group of embodiments, and the described features, structures, or characteristics may be combined or removed in any suitable manner in one or more embodiments. Further, in the FIGS., any connection between elements can permit one-way and/or two-way communication even if the depicted connection is a one-way or two-way arrow. Also, any device depicted in the drawings can be a different device. For example, if a mobile device is shown sending information, a wired device could also be used to send the information.

In addition, while the term “message” may have been used in the description of embodiments, the application may be applied to many types of networks and data. Furthermore, while certain types of connections, messages, and signaling may be depicted in exemplary embodiments, the application is not limited to a certain type of connection, message, and signaling.

In some embodiment, the method, system, and/or computer program product described herein utilize a decentralized database (such as a blockchain) that is a distributed storage system, which includes multiple nodes that communicate with each other. The decentralized database may include an append-only immutable data structure resembling a distributed ledger capable of maintaining records between mutually untrusted parties. The untrusted parties are referred to herein as peers or peer nodes. Each peer maintains a copy of the database records and no single peer can modify the database records without a consensus being reached among the distributed peers. For example, the peers may execute a consensus protocol to validate blockchain storage transactions, group the storage transactions into blocks, and build a hash chain over the blocks. This process forms the ledger by ordering the storage transactions, as is necessary, for consistency.

In various embodiments, a permissioned and/or a permission-less blockchain can be used. In a public, or permission-less, blockchain, anyone can participate without a specific identity (e.g., retaining anonymity). Public blockchains can involve native cryptocurrency and use consensus based on various protocols such as Proof of Work or Proof of Stake. Whereas, a permissioned blockchain database provides secure interactions among a group of entities that share a common goal but which do not fully trust one another, such as businesses that exchange funds, goods, (private) information, and the like.

Further, in some embodiment, the method, system, and/or computer program product can utilize a blockchain that operates arbitrary, programmable logic, tailored to a decentralized storage scheme and referred to as “smart contracts” or “chaincodes.” In some cases, specialized chaincodes may exist for management functions and parameters which are referred to as system chaincode (such as managing access to a different blockchain, a bridging blockchain client, etc.). In some embodiments, the method, system, and/or computer program product can further utilize smart contracts that are trusted distributed applications that leverage tamper-proof properties of the blockchain database and an underlying agreement between nodes, which is referred to as an endorsement or endorsement policy.

An endorsement policy allows chaincode to specify endorsers for a transaction in the form of a set of peer nodes that are necessary for endorsement. When a client sends the transaction to the peers (e.g., endorsers) specified in the endorsement policy, the transaction is executed to validate the transaction. After validation, the transactions enter an ordering phase in which a consensus protocol is used to produce an ordered sequence of endorsed transactions grouped into blocks.

In some embodiment, the method, system, and/or computer program product can utilize nodes that are the communication entities of the blockchain system. A “node” may perform a logical function in the sense that multiple nodes of different types can run on the same physical server. Nodes are grouped in trust domains and are associated with logical entities that control them in various ways. Nodes may include different types, such as a client or submitting-client node that submits a transaction-invocation to an endorser (e.g., peer), and broadcasts transaction-proposals to an ordering service (e.g., ordering node).

Another type of node is a peer node which can receive client submitted transactions, commit the transactions, and maintain a state and a copy of the ledger of blockchain transactions. Peers can also have the role of an endorser, although it is not a requirement. An ordering-service-node or orderer is a node running the communication service for all nodes, and which implements a delivery guarantee, such as a broadcast to each of the peer nodes in the system when committing/confirming transactions and modifying a world state of the blockchain, which is another name for the initial blockchain transaction which normally includes control and setup information.

In some embodiment, the method, system, and/or computer program product can utilize a ledger that is a sequenced, tamper-resistant record of all state transitions of a blockchain. State transitions may result from chaincode invocations (e.g., transactions, transfers, exchanges, etc.) submitted by participating parties (e.g., client nodes, ordering nodes, endorser nodes, peer nodes, etc.). Each participating party (such as a peer node) can maintain a copy of the ledger. A transaction may result in a set of asset key-value pairs being committed to the ledger as one or more operands, such as creates, updates, deletes, and the like. The ledger includes a blockchain (also referred to as a chain) which is used to store an immutable, sequenced record in blocks. The ledger also includes a state database that maintains a current state of the blockchain.

In some embodiment, the method, system, and/or computer program product described herein can utilize a chain that is a transaction log that is structured as hash-linked blocks, and each block contains a sequence of N transactions where N is equal to or greater than one. The block header includes a hash of the block's transactions, as well as a hash of the prior block's header. In this way, all transactions on the ledger may be sequenced and cryptographically linked together. Accordingly, it is not possible to tamper with the ledger data without breaking the hash links. A hash of a most recently added blockchain block represents every transaction on the chain that has come before it, making it possible to ensure that all peer nodes are in a consistent and trusted state. The chain may be stored on a peer node file system (e.g., local, attached storage, cloud, etc.), efficiently supporting the append-only nature of the blockchain workload.

The current state of the immutable ledger represents the latest values for all keys that are included in the chain transaction log. Since the current state represents the latest key values known to a channel, it is sometimes referred to as a world state. Chaincode invocations execute transactions against the current state data of the ledger. To make these chaincode interactions efficient, the latest values of the keys may be stored in a state database. The state database may be simply an indexed view into the chain's transaction log, it can therefore be regenerated from the chain at any time. The state database may automatically be recovered (or generated) upon peer node startup, and before transactions are accepted.

Some benefits of the instant solutions described and depicted herein include a method, system, and computer program product for implementing new, novel blockchain components that help protect an asset(s) involved in a cross-chain exchange. The exemplary embodiments solve the issues of asset claims involving multiple blockchains (e.g., cross-chain exchanges) and the occurrences of interruptions involving said blockchains.

It is noted that blockchain is different from a traditional database in that blockchain is not a central storage, but rather a decentralized, immutable, and secure storage, where nodes may share in changes to records in the storage. Some properties that are inherent in blockchain and which help implement the blockchain include, but are not limited to, an immutable ledger, smart contracts, security, privacy, decentralization, consensus, endorsement, accessibility, and the like, which are further described herein. According to various aspects, the system described herein is implemented due to immutable accountability, security, privacy, permitted decentralization, availability of smart contracts, endorsements and accessibility that are inherent and unique to blockchain.

In particular, the example embodiments provide numerous benefits over a traditional database. For example, through the blockchain, the embodiments provide for immutable accountability, security, privacy, permitted decentralization, availability of smart contracts, endorsements and accessibility that are inherent and unique to the blockchain.

Meanwhile, a traditional database could not be used to implement the example embodiments because it does not provide for a trusted environment in which peers/nodes can provide consideration in order to generate a new block in a blockchain. The traditional database does not provide for tamper proof storage, which can protect peer consideration and designation as a block generator. Thus, the proposed embodiments described herein utilizing blockchain networks cannot be implemented by the traditional database.

Turning now to FIG. 1A, illustrated is a blockchain architecture 100, in accordance with embodiments of the present disclosure. In some embodiments, the blockchain architecture 100 may include certain blockchain elements, for example, a group of blockchain nodes 102. The blockchain nodes 102 may include one or more blockchain nodes, e.g., peers 104-110 (these four nodes are depicted by example only). These nodes participate in a number of activities, such as a blockchain transaction addition and validation process (consensus). One or more of the peers 104-110 may endorse and/or recommend transactions based on an endorsement policy and may provide an ordering service for all blockchain nodes 102 in the blockchain architecture 100. A blockchain node may initiate a blockchain authentication and seek to write to a blockchain immutable ledger stored in blockchain layer 116, a copy of which may also be stored on the underpinning physical infrastructure 114. The blockchain configuration may include one or more applications 124 which are linked to application programming interfaces (APIs) 122 to access and execute stored program/application code 120 (e.g., chaincode, smart contracts, etc.) which can be created according to a customized configuration sought by participants and can maintain their own state, control their own assets, and receive external information. This can be deployed as a transaction and installed, via appending to the distributed ledger, on all blockchain nodes 104-110.

The blockchain base or platform 112 may include various layers of blockchain data, services (e.g., cryptographic trust services, virtual execution environment, etc.), and underpinning physical computer infrastructure that may be used to receive and store new transactions and provide access to auditors which are seeking to access data entries. The blockchain layer 116 may expose an interface that provides access to the virtual execution environment necessary to process the program code and engage the physical infrastructure 114. Cryptographic trust services 118 may be used to verify transactions such as asset exchange transactions and keep information private.

The blockchain architecture 100 of FIG. 1A may process and execute program/application code 120 via one or more interfaces exposed, and services provided, by blockchain platform 112. The application code 120 may control blockchain assets. For example, the application code 120 can store and transfer data, and may be executed by peers 104-110 in the form of a smart contract and associated chaincode with conditions or other code elements subject to its execution. As a non-limiting example, smart contracts may be generated to execute the transfer of assets/resources, the generation of assets/resources, etc. The smart contracts can themselves be used to identify rules associated with authorization (e.g., asset transfer rules, restrictions, etc.), access requirements (e.g., of a datastore, of an off-chain datastore, of who may participate in a transaction, etc.), and/or usage of the ledger. For example, the verifiable credentials 126 may be processed by one or more processing entities (e.g., virtual machines) included in the blockchain layer 116. The result 128 may include a plurality of linked shared documents (e.g., with each linked shared document recording the issuance of a smart contract in regard to the verifiable credentials 126 being committed by a selected group of peers based on an asset exchange schema, issuer policy, etc.). In some embodiments, the physical infrastructure 114 may be utilized to retrieve any of the data/information/assets/etc. described herein.

A smart contract may be created via a high-level application and programming language, and then written to a block in the blockchain. The smart contract may include executable code that is registered, stored, and/or replicated with a blockchain (e.g., a distributed network of blockchain peers). A transaction is an execution of the smart contract code that can be performed in response to conditions associated with the smart contract being satisfied. The executing of the smart contract may trigger a trusted modification(s) to a state of a digital blockchain ledger. The modification(s) to the blockchain ledger caused by the smart contract execution may be automatically replicated throughout the distributed network of blockchain peers through one or more consensus protocols.

The smart contract may write data to the blockchain in the format of key-value pairs. Furthermore, the smart contract code can read the values stored in a blockchain and use them in application operations. The smart contract code can write the output of various logic operations into the blockchain. The code may be used to create a temporary data structure in a virtual machine or other computing platform. Data written to the blockchain can be public and/or can be encrypted and maintained as private. The temporary data that is used/generated by the smart contract is held in memory by the supplied execution environment, then deleted once the data needed for the blockchain is identified.

A chaincode may include the code interpretation of a smart contract, with additional features. As described herein, the chaincode may be program code deployed on a computing network, where it is executed and validated by chain validators together during a consensus process. The chaincode receives a hash and retrieves from the blockchain a hash associated with the data template created by use of a previously stored feature extractor. If the hashes of the hash identifier and the hash created from the stored identifier template data match, then the chaincode sends an authorization key to the requested service. The chaincode may write to the blockchain data associated with the cryptographic details (e.g., thus committing a transaction associated with assets, etc.).

FIG. 1B illustrates an example of a blockchain transactional flow 150 between nodes of the blockchain in accordance with an example embodiment. Referring to FIG. 1B, the transaction flow may include a transaction proposal 191 sent by an application client node 160 to an endorsing peer node 181 (e.g., in some embodiments, the transaction proposal 191 may include a schema that prescribes a selected set of peers [peer nodes 181-184] to be used for a specific transaction). The endorsing peer 181 may verify the client signature and execute a chaincode function to initiate the transaction. The output may include the chaincode results, a set of key/value versions that were read in the chaincode (read set), and the set of keys/values that were written in chaincode (write set). The proposal response 192 is sent back to the client 160 along with an endorsement signature, if approved. The client 160 assembles the endorsements into a transaction payload 193 and broadcasts it to an ordering service node 184. The ordering service node 184 then delivers ordered transactions as blocks to all peers 181-183 on a channel. Before committal to the blockchain, each peer 181-183 may validate the transaction. For example, the peers may check the endorsement policy to ensure that the correct allotment of the specified peers have signed the results and authenticated the signatures against the transaction payload 193 (e.g., all the specified peers from the schema have validated and approved commitment of the transaction to the blockchain).

Referring again to FIG. 1B, the client node 160 initiates the transaction 191 by constructing and sending a request to the peer node 181, which in this example is an endorser. The client 160 may include an application leveraging a supported software development kit (SDK), which utilizes an available API to generate a transaction proposal 191. The proposal is a request to invoke a chaincode function so that data can be read and/or written to the ledger. The SDK may reduce the package of the transaction proposal 191 into a properly architected format (e.g., protocol buffer over a remote procedure call (RPC)) and take the client's cryptographic credentials to produce a unique signature for the transaction proposal 191.

In response, the endorsing peer node 181 may verify (a) that the transaction proposal 191 is well formed, (b) the transaction has not been submitted already in the past (replay-attack protection), (c) the signature is valid, and (d) that the submitter (client 160, in the example) is properly authorized to perform the proposed operation on that channel. The endorsing peer node 181 may take the transaction proposal 191 inputs as arguments to the invoked chaincode function. The chaincode is then executed against a current state database to produce transaction results including a response value, read set, and write set. However, no updates are made to the ledger at this point. In some embodiments, the set of values, along with the endorsing peer node's 181 signature is passed back as a proposal response 192 to the SDK of the client 160 which parses the payload for the application to consume.

In response, the application of the client 160 inspects/verifies the endorsing peers signatures and compares the proposal responses to determine if the proposal response is the same. If the chaincode only queried the ledger, the application would inspect the query response and would typically not submit the transaction to the ordering node service 184. If the client application intends to submit the transaction to the ordering node service 184 to update the ledger, the application determines if the specified endorsement policy has been fulfilled before submitting. Here, the client may include only one of multiple parties to the transaction. In this case, each client may have their own endorsing node, and each endorsing node will need to endorse the transaction. The architecture is such that even if an application selects not to inspect responses or otherwise forwards an unendorsed transaction, the endorsement policy will still be enforced by peers and upheld at the commit validation phase.

After successful inspection, in the transaction payload step 193, the client 160 assembles endorsements into a transaction and broadcasts the transaction proposal 191 and response within a transaction message to the ordering node 184. The transaction may contain the read/write sets, the endorsing peers signatures and a channel ID (e.g., if a specific [off-chain] datastore is to be utilized). The ordering node 184 does not need to inspect the entire content of a transaction in order to perform its operation, instead the ordering node 184 may simply receive transactions from all channels in the network, order them chronologically by channel, and create blocks of transactions per channel.

The blocks of the transaction are delivered from the ordering node 184 to all peer nodes 181-183 on the channel. The transactions 194 within the block are validated to ensure any endorsement policy is fulfilled and to ensure that there have been no changes to ledger state for read set variables since the read set was generated by the transaction execution. Transactions in the block are tagged as being valid or invalid. Furthermore, in steps 195 each peer node 181-183 appends the block to the channel's chain, and for each valid transaction the write sets are committed to current state database. An event is emitted, to notify the client application that the transaction (invocation) has been immutably appended to the chain, as well as to notify whether the transaction was validated or invalidated.

Referring now to FIGS. 2A-E, illustrated is an example system 200 (e.g., blockchain network, etc.) at various stages of a block generator node auction, in accordance with embodiments of the present disclosure. As depicted, but in no way limiting, the system 200 includes a duration 202A-E, which depicts intervals of time of the auction, a holder 204, a first node 206 with a digital wallet 208, a second node 210 with a digital wallet 212, a third node 214 with a digital wallet 216, a first block 218, a second block 220, a third block 222, and a transaction pool 224 (which may include transactions that are not yet in a chain).

As discussed more fully below, the nodes 206, 210, and 214 compete to be able to add a next block to a chain. To join the block generator node auction, the nodes 206, 210, and 214 must first deposit funds (e.g., as depicted by units) in the digital wallets 208, 212, and 216, which are respectively assigned to each of the nodes 206, 210, and 214. It is noted that most popular solution use wallets based on public key infrastructure (PKI), where the public key is the wallet address and private key works as a “padlock key.” The private key owner can transfer funds to another wallet, so it is important to keep the private key safe.

In some embodiments, the blocks 218, 220, and 222 are added periodically in a process called “auction.” In this process, the nodes 206, 210, and 214 are trying to outbid (with consideration) one another. Typically, the node that bids the most wins, however, as presented herein any node 206, 210, and 214 can also decide to fold (e.g., give up, become unavailable) at any moment. In such a case, all funds used for bidding by that node stay with the holder 204. In some embodiments, the holder 204 can be a specialized node or smart contract. In some embodiments, the smart contract might be considered more trusted than the specialized node that holds original consideration (e.g., coins, tokens, etc.) that is provided by the system 200 and which holds each bid from made by the nodes 206, 210, and 214. In some embodiments, the winner of the block generator node auction can add a block (e.g., blocks 218, 220, 222, etc.) to the chain and receives the units from the holder 204 to its respective digital wallet (e.g., 208, 212, 216).

As depicted, the auction lasts for a certain duration 202A (e.g., one minute). The auction is then divided into rounds (e.g., 20 seconds), as depicted by durations 202B-E of FIGS. 2B-E. In a round, a node 206, 210, 214 can bet (e.g., make an offer, provide consideration, etc.), update said bet by: raising (e.g., increase consideration, increase the size of an existing bet in the same betting round, etc.), checking (e.g., match consideration, match current bet, etc.), or fold (e.g., indicate themselves as unavailable, forfeit interest in the current pot held by the holder 204, etc.).

In some embodiments, if a node 206, 210, 214 wants to stay in the auction and go to next round (e.g., based on the durations 202B-E), the node 206, 210, 214 is required to at least call (e.g., abstained consideration [neither increase nor fold]). In some embodiments, in the case of identified inactivity of a node 206, 210, 214, the node 206, 210, 214 will be automatically made unavailable. In some embodiments, the auction ends when all but one node 206, 210, 214 folds or after a predefined set of rounds. If more than one node 206, 210, 214 gets to the end of the auction, the node selected to be the blockchain generator node is selected based on a highest block hash (e.g., the hash depicted in the first block 218, which is higher than the hash depicted in the third block 222).

In some embodiments, the nodes 206, 210, 214 may generate new blocks (e.g., 218, 220, 222) based on unconfirmed transactions from the transaction pool 224 before entering the auction. In such an embodiment, the nodes 206, 210, 214 are free to choose which transactions go into the new block. When the block is ready, every node generates a hash of its block. In some embodiments, due to the short amount of time between each auction, it is nearly impossible to check all possible hashes, thus hashes presented by each node 206, 210, 214 are randomized. In some embodiments, to encourage nodes to participate in the auction, the pot (e.g., initial 100 units in the holder 204) is not emptied when the auction starts, that is, new coins/units in the pot are generated accordingly to an amount of a new block size (e.g., solving an issue with the supply of new coins in the network).

As depicted, at duration 202A of FIG. 2A, each of the nodes 206, 210, 214 generates a block 218, 220, and 222 with their selected transactions (which may be selected from the transaction pool 224) and the blocks 218, 220, and 222 are then given a randomized hash. Continuing, at duration 202B of FIG. 2B, a first round of the auction begins, where the first round lasts 20 seconds (as indicated by the duration 202B providing that the total time for the auction ends in 41 seconds and bidding for the first round ends in 1 second (e.g., slot ends)) with and each of the nodes 206, 210, 214 provides 30 units of considerations to the holder 204, where the first node 206 provided an initial 30 units of consideration and each of the second node 210 and third node 214 provided a matched consideration.

At duration 202C of FIG. 2C, a second round of the auction takes place, at which point the consideration from each of the nodes 206, 210, 214 is provided to the holder 204 (depicted by the +90 units, i.e., 30 units from each of the nodes 206, 210, 214). As depicted, at duration 202C the first node 206 provides 30 more units of consideration to be available during duration 202C, the second node 210 provides no consideration and indicates it is unavailable (e.g., folds), and the third node 214 provides abstained consideration (e.g., calls).

At duration 202D of FIG. 2D, a third round of the auction takes place, at which point the consideration from each of the nodes 206, 214, which participated in the second round is provided to the holder 204 (depicted by the +60 units). As depicted, at duration 202D the first node 206 provides 10 more units of consideration to be available during duration 202D and the third node 214 provides increased (e.g., raised) consideration of 20 units. Continuing, at duration 202E of FIG. 2E, since the third node 214 increased consideration, the third round of the auction continues, and the first node 206 provides abstained consideration.

In some embodiments, after duration 202E, the auction ends and since the first node 206 and the third node 214 ended with the same amount of consideration, the system 200 looks at the hash of the first block 218 that is associated with the first node 206 and the hash of the third block 222 that is associated with the third node 214. Since the hash of the first block 218 is larger than the hash of the third block 222, the first node 206 may be designated as the block generator for the next block in the blockchain and/or the first block 218 is then committed/provided to the blockchain.

Referring now to FIG. 3, illustrated is a flowchart of an example method for designating a block generator node within a blockchain. In some embodiments, the method 300 may be performed by a processor, node, and/or peer node in a blockchain network. In some embodiments, the method 300 begins at operation 302, where the processor receives, from two or more nodes in a blockchain, respective consideration from each of the two or more nodes at a first time (e.g., duration).

In some embodiments, the method 300 proceeds to operation 304, where the processor receives respective updates (e.g., matches, calls, etc.) from each of the two or more nodes at a second time. In some embodiments, the method 300 proceeds to operation 306, where the processor determines whether a single node of the two or more nodes is available after the respective updates. In some embodiments, the method 300 proceeds to operations 308, where the processor designates the single node as the block generator node. In some embodiments, after operation 308, the method 300 may end.

In some embodiments, discussed below, there are one or more operations of the method 300 not depicted for the sake of brevity. Accordingly, in some embodiments, determining whether the single node of the two or more nodes is available after the respective updates may include the processor identifying that each of the other nodes provided is unavailable (e.g., have folded).

In some embodiments, determining whether the single node of the two or more nodes is available after the respective updates may include the processor identifying that the single node has a greatest consideration after the second time. In some embodiments, determining whether the single node of the two or more nodes is available after the respective updates may include the processor comparing a set of hashes associated with the two or more nodes and the processor identifying that the single node is associated with a highest hash of the two or more nodes.

In some embodiments, the respective updates may include the single node increasing consideration, a second node identifying as unavailable, and a third node matching the increased consideration of the single node. In such an embodiment, the processor may retain consideration of the second node and provide the consideration to the single node. In some embodiments, the processor may generate a local consideration and combine the local consideration with the respective consideration from each of the two or more nodes.

It is to be understood that although this disclosure includes a detailed description on cloud computing, implementation of the teachings recited herein are not limited to a cloud computing environment. Rather, embodiments of the present disclosure are capable of being implemented in conjunction with any other type of computing environment now known or later developed.

Cloud computing is a model of service delivery for enabling convenient, on-demand network access to a shared pool of configurable computing resources (e.g., networks, network bandwidth, servers, processing, memory, storage, applications, virtual machines, and services) that can be rapidly provisioned and released with minimal management effort or interaction with a provider of the service. This cloud model may include at least five characteristics, at least three service models, and at least four deployment models.

Characteristics are as follows:

On-demand self-service: a cloud consumer can unilaterally provision computing capabilities, such as server time and network storage, as needed automatically without requiring human interaction with the service's provider.

Broad network access: capabilities are available over a network and accessed through standard mechanisms that promote use by heterogeneous thin or thick client platforms (e.g., mobile phones, laptops, and PDAs).

Resource pooling: the provider's computing resources are pooled to serve multiple consumers using a multi-tenant model, with different physical and virtual resources dynamically assigned and reassigned according to demand. There is a sense of portion independence in that the consumer generally has no control or knowledge over the exact portion of the provided resources but may be able to specify portion at a higher level of abstraction (e.g., country, state, or datacenter).

Rapid elasticity: capabilities can be rapidly and elastically provisioned, in some cases automatically, to quickly scale out and rapidly released to quickly scale in. To the consumer, the capabilities available for provisioning often appear to be unlimited and can be purchased in any quantity at any time.

Measured service: cloud systems automatically control and optimize resource use by leveraging a metering capability at some level of abstraction appropriate to the type of service (e.g., storage, processing, bandwidth, and active user accounts). Resource usage can be monitored, controlled, and reported, providing transparency for both the provider and consumer of the utilized service.

Service Models are as follows:

Software as a Service (SaaS): the capability provided to the consumer is to use the provider's applications running on a cloud infrastructure. The applications are accessible from various client devices through a thin client interface such as a web browser (e.g., web-based e-mail). The consumer does not manage or control the underlying cloud infrastructure including network, servers, operating systems, storage, or even individual application capabilities, with the possible exception of limited user-specific application configuration settings.

Platform as a Service (PaaS): the capability provided to the consumer is to deploy onto the cloud infrastructure consumer-created or acquired applications created using programming languages and tools supported by the provider. The consumer does not manage or control the underlying cloud infrastructure including networks, servers, operating systems, or storage, but has control over the deployed applications and possibly application hosting environment configurations.

Infrastructure as a Service (IaaS): the capability provided to the consumer is to provision processing, storage, networks, and other fundamental computing resources where the consumer is able to deploy and run arbitrary software, which can include operating systems and applications. The consumer does not manage or control the underlying cloud infrastructure but has control over operating systems, storage, deployed applications, and possibly limited control of select networking components (e.g., host firewalls).

Deployment Models are as follows:

Private cloud: the cloud infrastructure is operated solely for an organization. It may be managed by the organization or a third party and may exist on-premises or off-premises.

Community cloud: the cloud infrastructure is shared by several organizations and supports a specific community that has shared concerns (e.g., mission, security requirements, policy, and compliance considerations). It may be managed by the organizations or a third party and may exist on-premises or off-premises.

Public cloud: the cloud infrastructure is made available to the general public or a large industry group and is owned by an organization selling cloud services.

Hybrid cloud: the cloud infrastructure is a composition of two or more clouds (private, community, or public) that remain unique entities but are bound together by standardized or proprietary technology that enables data and application portability (e.g., cloud bursting for load-balancing between clouds).

A cloud computing environment is service oriented with a focus on statelessness, low coupling, modularity, and semantic interoperability. At the heart of cloud computing is an infrastructure that includes a network of interconnected nodes.

FIG. 4A, illustrated is a cloud computing environment 410 is depicted. As shown, cloud computing environment 410 includes one or more cloud computing nodes 400 with which local computing devices used by cloud consumers, such as, for example, personal digital assistant (PDA) or cellular telephone 400A, desktop computer 400B, laptop computer 400C, and/or automobile computer system 400N may communicate. Nodes 400 may communicate with one another. They may be grouped (not shown) physically or virtually, in one or more networks, such as Private, Community, Public, or Hybrid clouds as described hereinabove, or a combination thereof.

This allows cloud computing environment 410 to offer infrastructure, platforms and/or software as services for which a cloud consumer does not need to maintain resources on a local computing device. It is understood that the types of computing devices 400A-N shown in FIG. 4A are intended to be illustrative only and that computing nodes 400 and cloud computing environment 410 can communicate with any type of computerized device over any type of network and/or network addressable connection (e.g., using a web browser).

FIG. 4B, illustrated is a set of functional abstraction layers provided by cloud computing environment 410 (FIG. 4A) is shown. It should be understood in advance that the components, layers, and functions shown in FIG. 4B are intended to be illustrative only and embodiments of the disclosure are not limited thereto. As depicted below, the following layers and corresponding functions are provided.

Hardware and software layer 415 includes hardware and software components. Examples of hardware components include: mainframes 402; RISC (Reduced Instruction Set Computer) architecture based servers 404; servers 406; blade servers 408; storage devices 411; and networks and networking components 412. In some embodiments, software components include network application server software 414 and database software 416.

Virtualization layer 420 provides an abstraction layer from which the following examples of virtual entities may be provided: virtual servers 422; virtual storage 424; virtual networks 426, including virtual private networks; virtual applications and operating systems 428; and virtual clients 430.

In one example, management layer 440 may provide the functions described below. Resource provisioning 442 provides dynamic procurement of computing resources and other resources that are utilized to perform tasks within the cloud computing environment. Metering and Pricing 444 provide cost tracking as resources are utilized within the cloud computing environment, and billing or invoicing for consumption of these resources. In one example, these resources may include application software licenses. Security provides identity verification for cloud consumers and tasks, as well as protection for data and other resources. User portal 446 provides access to the cloud computing environment for consumers and system administrators. Service level management 448 provides cloud computing resource allocation and management such that required service levels are met. Service Level Agreement (SLA) planning and fulfillment 450 provide pre-arrangement for, and procurement of, cloud computing resources for which a future requirement is anticipated in accordance with an SLA.

Workloads layer 460 provides examples of functionality for which the cloud computing environment may be utilized. Examples of workloads and functions which may be provided from this layer include: mapping and navigation 462; software development and lifecycle management 464; virtual classroom education delivery 466; data analytics processing 468; transaction processing 470; and block generator designation 472.

FIG. 5, illustrated is a high-level block diagram of an example computer system 501 that may be used in implementing one or more of the methods, tools, and modules, and any related functions, described herein (e.g., using one or more processor circuits or computer processors of the computer), in accordance with embodiments of the present disclosure. In some embodiments, the major components of the computer system 501 may comprise one or more CPUs 502, a memory subsystem 504, a terminal interface 512, a storage interface 516, an I/O (Input/Output) device interface 514, and a network interface 518, all of which may be communicatively coupled, directly or indirectly, for inter-component communication via a memory bus 503, an I/O bus 508, and an I/O bus interface unit 510.

The computer system 501 may contain one or more general-purpose programmable central processing units (CPUs) 502A, 502B, 502C, and 502D, herein generically referred to as the CPU 502. In some embodiments, the computer system 501 may contain multiple processors typical of a relatively large system; however, in other embodiments the computer system 501 may alternatively be a single CPU system. Each CPU 502 may execute instructions stored in the memory subsystem 504 and may include one or more levels of on-board cache.

System memory 504 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 522 or cache memory 524. Computer system 501 may further include other removable/non-removable, volatile/non-volatile computer system storage media. By way of example only, storage system 526 can be provided for reading from and writing to a non-removable, non-volatile magnetic media, such as a “hard drive.” Although not shown, a magnetic disk drive for reading from and writing to a removable, non-volatile magnetic disk (e.g., a “floppy disk”), or an optical disk drive for reading from or writing to a removable, non-volatile optical disc such as a CD-ROM, DVD-ROM or other optical media can be provided. In addition, memory 504 can include flash memory, e.g., a flash memory stick drive or a flash drive. Memory devices can be connected to memory bus 503 by one or more data media interfaces. The memory 504 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of various embodiments.

One or more programs/utilities 528, each having at least one set of program modules 530 may be stored in memory 504. The programs/utilities 528 may include a hypervisor (also referred to as a virtual machine monitor), one or more operating systems, one or more application programs, other program modules, and program data. Each of the operating systems, one or more application programs, other program modules, and program data or some combination thereof, may include an implementation of a networking environment. Programs 528 and/or program modules 530 generally perform the functions or methodologies of various embodiments.

Although the memory bus 503 is shown in FIG. 5 as a single bus structure providing a direct communication path among the CPUs 502, the memory subsystem 504, and the I/O bus interface 510, the memory bus 503 may, in some embodiments, include multiple different buses or communication paths, which may be arranged in any of various forms, such as point-to-point links in hierarchical, star or web configurations, multiple hierarchical buses, parallel and redundant paths, or any other appropriate type of configuration. Furthermore, while the I/O bus interface 510 and the I/O bus 508 are shown as single respective units, the computer system 501 may, in some embodiments, contain multiple I/O bus interface units 510, multiple I/O buses 508, or both. Further, while multiple I/O interface units are shown, which separate the I/O bus 508 from various communications paths running to the various I/O devices, in other embodiments some or all of the I/O devices may be connected directly to one or more system I/O buses.

In some embodiments, the computer system 501 may be a multi-user mainframe computer system, a single-user system, or a server computer or similar device that has little or no direct user interface, but receives requests from other computer systems (clients). Further, in some embodiments, the computer system 501 may be implemented as a desktop computer, portable computer, laptop or notebook computer, tablet computer, pocket computer, telephone, smartphone, network switches or routers, or any other appropriate type of electronic device.

It is noted that FIG. 5 is intended to depict the representative major components of an exemplary computer system 501. In some embodiments, however, individual components may have greater or lesser complexity than as represented in FIG. 5, components other than or in addition to those shown in FIG. 5 may be present, and the number, type, and configuration of such components may vary.

As discussed in more detail herein, it is contemplated that some or all of the operations of some of the embodiments of methods described herein may be performed in alternative orders or may not be performed at all; furthermore, multiple operations may occur at the same time or as an internal part of a larger process.

The present disclosure may be a system, a method, and/or a computer program product at any possible technical detail level of integration. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present disclosure.

The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.

Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.

Computer readable program instructions for carrying out operations of the present disclosure may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, configuration data for integrated circuitry, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++, or the like, and procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present disclosure.

Aspects of the present disclosure are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.

These computer readable program instructions may be provided to a processor of a computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the blocks may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be accomplished as one step, executed concurrently, substantially concurrently, in a partially or wholly temporally overlapping manner, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.

The descriptions of the various embodiments of the present disclosure have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.

Although the present disclosure has been described in terms of specific embodiments, it is anticipated that alterations and modification thereof will become apparent to the skilled in the art. Therefore, it is intended that the following claims be interpreted as covering all such alterations and modifications as fall within the true spirit and scope of the disclosure. 

What is claimed is:
 1. A method for designating a block generator node within a blockchain, the method comprising: receiving, from two or more nodes in the blockchain, respective consideration from each of the two or more nodes at a first time; receiving respective updates from each of the two or more nodes at a second time; determining whether a single node of the two or more nodes is available after the respective updates; and designating the single node as the block generator node.
 2. The method of claim 1, wherein determining whether the single node of the two or more nodes is available after the respective updates includes: identifying that each of the other nodes provided is unavailable.
 3. The method of claim 1, wherein determining whether the single node of the two or more nodes is available after the respective updates includes: identifying that the single node has a greatest consideration after the second time.
 4. The method of claim 1, wherein determining whether the single node of the two or more nodes is available after the respective updates includes: comparing a set of hashes associated with the two or more nodes; and identifying that the single node is associated with a highest hash of the two or more nodes.
 5. The method of claim 1, wherein the respective updates include the single node increasing consideration, a second node identifying as unavailable, and a third node matching the increased consideration of the single node.
 6. The method of claim 5, further comprising: retaining the consideration of the second node; and providing the consideration to the single node.
 7. The method of claim 1, further comprising: generating a local consideration; and combining the local consideration with the respective consideration from each of the two or more nodes.
 8. A system for designating a block generator node within a blockchain, the system comprising: a memory; and a processor in communication with the memory, the processor being configured to perform operations comprising: receiving, from two or more nodes in the blockchain, respective consideration from each of the two or more nodes at a first time; receiving respective updates from each of the two or more nodes at a second time; determining whether a single node of the two or more nodes is available after the respective updates; and designating the single node as the block generator node.
 9. The system of claim 8, wherein determining whether the single node of the two or more nodes is available after the respective updates includes: identifying that each of the other nodes provided is unavailable.
 10. The system of claim 8, wherein determining whether the single node of the two or more nodes is available after the respective updates includes: identifying that the single node has a greatest consideration after the second time.
 11. The system of claim 8, wherein determining whether the single node of the two or more nodes is available after the respective updates includes: comparing a set of hashes associated with the two or more nodes; and identifying that the single node is associated with a highest hash of the two or more nodes.
 12. The system of claim 8, wherein the respective updates include the single node increasing consideration, a second node identifying as unavailable, and a third node matching the increased consideration of the single node.
 13. The system of claim 12, the processor being further configured to perform operations comprising: retaining the consideration of the second node; and providing the consideration to the single node.
 14. The system of claim 8, the processor being further configured to perform operations comprising: generating a local consideration; and combining the local consideration with the respective consideration from each of the two or more nodes.
 15. A computer program product for designating a block generator node within a blockchain, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processors to perform a function, the function comprising: receiving, from two or more nodes in the blockchain, respective consideration from each of the two or more nodes at a first time; receiving respective updates from each of the two or more nodes at a second time; determining whether a single node of the two or more nodes is available after the respective updates; and designating the single node as the block generator node.
 16. The computer program product of claim 15, wherein determining whether the single node of the two or more nodes is available after the respective updates includes: identifying that each of the other nodes provided is unavailable.
 17. The computer program product of claim 15, wherein determining whether the single node of the two or more nodes is available after the respective updates includes: identifying that the single node has a greatest consideration after the second time.
 18. The computer program product of claim 15, wherein determining whether the single node of the two or more nodes is available after the respective updates includes: comparing a set of hashes associated with the two or more nodes; and identifying that the single node is associated with a highest hash of the two or more nodes.
 19. The computer program product of claim 15, wherein the respective updates include the single node increasing consideration, a second node identifying as unavailable, and a third node matching the increased consideration of the single node.
 20. The computer program product of claim 19, wherein the functions further comprise: retaining the consideration of the second node; and providing the consideration to the single node. 